Boolean satisfiability problem

Results: 324



#Item
31Model theory / Constraint programming / Logical truth / Mathematical logic / Formal languages / Structure / Interpretation / Satisfiability / Substitution / Constraint satisfaction problem / Complexity of constraint satisfaction / Boolean satisfiability problem

Low-level dichotomy for Quantified Constraint Satisfaction Problems Barnaby Martin 1 School of Engineering and Computing Sciences, Durham University, Science Labs, South Road, Durham DH1 3LE, U.K.

Add to Reading List

Source URL: www.bedewell.com

Language: English - Date: 2011-07-07 11:03:52
32Formal methods / Automated theorem proving / Logic in computer science / Boolean algebra / Electronic design automation / Conflict-Driven Clause Learning / Boolean satisfiability problem / Satisfiability modulo theories / Clause / Vampire / Propositional calculus / Lambda calculus

A Verified SAT Solver Framework with Learn, Forget, Restart, and Incrementality Jasmin Christian Blanchette1,2 , Mathias Fleury2 , and Christoph Weidenbach2 1 2

Add to Reading List

Source URL: people.mpi-inf.mpg.de

Language: English - Date: 2016-06-17 09:50:06
33Logic / Mathematics / Constraint programming / Abstraction / Model theory / Boolean satisfiability problem / Electronic design automation / Logic in computer science / Complexity of constraint satisfaction / Constraint satisfaction problem / Satisfiability / Binary relation

The complexity of satisfaction problems in Reverse Mathematics Ludovic Patey Laboratoire PPS, Université Paris Diderot, Paris, FRANCE

Add to Reading List

Source URL: ludovicpatey.com

Language: English - Date: 2014-03-18 04:19:11
34Automated theorem proving / Logic programming / Logic in computer science / Boolean algebra / Model theory / Substitution / Boolean satisfiability problem / Interpretation / Relationships among probability distributions / Lifting theory

THE COMPLEXITY OF SATISFACTION PROBLEMS IN REVERSE MATHEMATICS LUDOVIC PATEY Abstract. Satisfiability problems play a central role in computer science and engineering as a general framework for studying the complexity of

Add to Reading List

Source URL: ludovicpatey.com

Language: English - Date: 2015-02-06 12:14:26
35Mathematical logic / Mathematics / Logic / Boolean algebra / First-order logic / Propositional calculus / FO / Quantifier / Boolean satisfiability problem / True quantified Boolean formula / Model theory / Peano axioms

École Doctorale de l’École polytechnique I NRIA THÈSE DE DOCTORAT Présentée par

Add to Reading List

Source URL: cedeela.fr

Language: English - Date: 2015-10-28 05:35:30
36Logic / Mathematical logic / Abstraction / Model theory / Non-classical logic / Logic in computer science / Predicate logic / First-order logic / Boolean satisfiability problem / Gdel numbering / Many-valued logic / Kripke semantics

First-order satisfiability in Gödel logics: an NP-complete fragment Matthias Baaza,1 , Agata Ciabattonia,2 , Norbert Preininga,b,3 a b

Add to Reading List

Source URL: www.preining.info

Language: English - Date: 2014-04-03 01:14:57
37Logic in computer science / Combinatorial optimization / Operations research / Numerical software / Maximum satisfiability problem / Constraint satisfaction / Mathematical optimization / Solver / Satisfiability / Integer programming / Constraint / Boolean satisfiability problem

Fifth Competition of Pseudo-Boolean Solvers (PB’10) Call for Solvers and Benchmarks http://www.cril.univ-artois.fr/PB10/ G OAL Like the previous competitions (PB05, PB06, PB07 and PB09), the goal is to assess the state

Add to Reading List

Source URL: www.cril.univ-artois.fr

Language: English - Date: 2010-05-25 10:09:54
38Theoretical computer science / Mathematical logic / Automated theorem proving / Mathematics / Formal methods / Logic in computer science / Constraint programming / Electronic design automation / Conflict-Driven Clause Learning / DPLL algorithm / Boolean satisfiability problem / Satisfiability modulo theories

Accelerating lemma learning using joins - DPLL(t) Nikolaj Bjørner Microsoft Research Bruno Dutertre SRI International

Add to Reading List

Source URL: yices.csl.sri.com

Language: English - Date: 2015-12-11 18:43:06
39Theoretical computer science / Mathematical logic / Mathematics / Constraint programming / Automated theorem proving / Electronic design automation / Formal methods / NP-complete problems / Boolean satisfiability problem / DPLL algorithm / Symbol / Conjunctive normal form

LNCSA Tutorial on Satisfiability Modulo Theories

Add to Reading List

Source URL: yices.csl.sri.com

Language: English - Date: 2015-12-11 18:43:06
40Theoretical computer science / Logic / Mathematics / Constraint programming / Electronic design automation / Formal methods / Logic in computer science / NP-complete problems / Satisfiability modulo theories / Boolean satisfiability problem / Simplex algorithm / Satisfiability

A Fast Linear-Arithmetic Solver for DPLL(T) Bruno Dutertre and Leonardo de Moura Computer Science Laboratory, SRI International, 333 Ravenswood Avenue, Menlo Park, CA 94025, USA {bruno, demoura}@csl.sri.com

Add to Reading List

Source URL: yices.csl.sri.com

Language: English - Date: 2015-12-11 18:43:06
UPDATE